An inequality connecting entropy distance,Fisher Information and large deviations

In this paper we introduce a new generalisation of the relative Fisher Information for Markov jump processes on a finite or countable state space, and prove an inequality which connects this object with the relative entropy and a large deviation rate functional. In addition to possessing various favourable properties, we show that this generalised Fisher Information converges to the classical Fisher Information in an appropriate limit. We then use this generalised Fisher Information and the aforementioned inequality to qualitatively study coarse-graining problems for jump processes on discrete spaces.     

Theory of chemical bonds in metalloenzymes XXII: a concerted bond-switching mechanism for the oxygen–oxygen bond formation coupled with one electron transfer for water oxidation in the oxygen-evolving complex of photosystem II

ABSTRACT

QM(UB3LYP)/MM(AMBER) calculations were performed for the locations of the transition structure (TS) of the oxygen–oxygen (O–O) bond formation in the S₄ state of the oxygen-evolving complex (OEC) of photosystem II (PSII). The natural orbital (NO) analysis of the broken-symmetry (BS) solutions was also performed to elucidate the nature of the chemical bonds at TS on the basis of several chemical indices defined by the occupation numbers of NO. The computational results revealed a concerted bond switching (CBS) mechanism for the oxygen–oxygen bond formation coupled with the one-electron transfer (OET) for water oxidation in OEC of PSII. The orbital interaction between the σ-HOMO of the Mn(IV)₄–O₍₅₎ bond and the π*-LUMO of the Mn(V)₁=O₍₆₎ bond plays an important role for the concerted O–O bond formation for water oxidation in the CaMn₄O₆ cluster of OEC of PSII. One electron transfer (OET) from the π-HOMO of the Mn(V)₁=O₍₆₎ bond to the σ*-LUMO of the Mn(IV)₄–O₍₅₎ bond occurs for the formation of electron transfer diradical, where the generated anion radical [Mn(IV)₄–O₍₅₎]^-? part is relaxed to the ?Mn(III)₄?…?O₍₅₎^- structure and the cation radical [O₍₆₎=Mn(V)₁]⁺ ? part is relaxed to the ⁺O₍₆₎–Mn(IV)₁? structure because of the charge-spin separation for the electron-and hole-doped Mn–oxo bonds. Therefore, the local spins are responsible for the one-electron reductions of Mn(IV)₄->Mn(III)₄ and Mn(V)₁->Mn(IV)₁. On the other hand, the O₍₅₎^- and O₍₆₎⁺ sites generated undergo the O–O bond formation in the CaMn₄O₆ cluster. The Ca(II) ion in the cubane- skeleton of the CaMn₄O₆ cluster assists the above orbital interactions by the lowering of the orbital energy levels of π*-LUMO of Mn(V)₁=O₍₆₎ and σ*-LUMO of Mn(IV)₄–O₍₅₎, indicating an important role of its Lewis acidity. Present CBS mechanism for the O–O bond formation coupled with one electron reductions of the high-valent Mn ions is different from the conventional radical coupling (RC) and acid-base (AB) mechanisms for water oxidation in artificial and native photosynthesis systems. The proton-coupled electron transfer (PC-OET) mechanism for the O–O bond formation is also touched in relation to the CBS-OET mechanism.     

Kalman filtering of a space-time Markov random field

In this paper, finite-dimensional recursive filters for space-time Markov random fields are derived. These filters can be used with the expectation maximization (EM) algorithm to yield maximum likelihood estimates of the parameters of the model.     

Simulated annealing with noisy or imprecise energy measurements

The annealing algorithm (Ref. 1) is modified to allow for noisy or imprecise measurements of the energy cost function. This is important when the energy cannot be measured exactly or when it is computationally expensive to do so. Under suitable conditions on the noise/imprecision, it is shown that the modified algorithm exhibits the same convergence in probability to the globally minimum energy states as the annealing algorithm (Ref. 2). Since the annealing algorithm will typically enter and exit the minimum energy states infinitely often with probability one, the minimum energy state visited by the annealing algorithm is usually tracked. The effect of using noisy or imprecise energy measurements on tracking the minimum energy state visited by the modified algorithms is examined.The research reported here has been supported under Contracts AFOSR-85-0227, DAAG-29-84-K-0005, and DAAL-03-86-K-0171 and a Purdue Research Initiation Grant.     

光突发交换网络中最长队列优先调度组装机制

提出了光突发交换网络中的最长队列优先调度（LQF-SA）机制，将边缘节点的突发组装和突发调度两种技术紧密结合在一起.在现实网络中，业务通常是非均匀分布的，即在某些源宿对之间存在更大的业务流量.仿真结果表明，LQF-SA机制可以很好地完成非均匀分布业务流的组装.即使在均匀分布业务流输入下，LQF-SA机制在突发大小分布、组装效率和突发丢失率等方面也优于已提出的轮询调度组装（RR-SA）机制.     

Weak convergence of the U-statistic and weak invariance of the one-sample rank order statistic for Markov processes and ARMA models

Harel and Puri (1989, J. Multivariate Anal. 29) studied the asymptotic behavior of the U-statistic and the one-sample rank order statistic for nonstationary absolutely regular processes. In this note, we present some applications of these results for Markov processes as well as ARMA processes.     

Modelling recruitment training in mathematical human resource planning

This paper deals with mathematical human resource planning; more specifically, it suggests a new model for a manpower‐planning system. In general, we study a k‐classed hierarchical system where the workforce demand at each time period is satisfied through internal mobility and recruitment. The motivation for this work is based on various European Union incentives, which promote regional or local government assistance programs that could be exploited by firms not only for hiring and training newcomers, but also to improve the skills and knowledge of their existing personnel. In this respect, in our augmented mobility model we establish a new ‘training/standby’ class, which serves as a manpower inventory position for potential recruits. This class, which may very well be internal or external to the system, is incorporated into the framework of a non‐homogeneous Markov chain model. Furthermore, cost objectives are employed using the goal‐programming approach, under different operating assumptions, in order to minimize the operational cost in the presence of system's constraints and regulations. Copyright © 2002 John Wiley & Sons, Ltd.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.